The Compositional Rule of Inference: Introduction, theoretical considerations, and exact calculation formulas

نویسندگان

  • Robert Fullér
  • Brigitte Werners
چکیده

This paper provides a short introduction to the compositional rule of inference (Zadeh 1973), which is the mainly used inference rule in approximate reasoning. Stability results are given and exact computational formulas are provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On computation of the compositional rule of inference under triangular norms

This paper is devoted to the derivation of exact calculation formulas for the compositional rule of inference under Archimedean t-norms, when both the observation and the relation parts are given by Hellendoorn’s φ-function [6].

متن کامل

Double Fuzzy Implications-Based Restriction Inference Algorithm

The main condition of the differently implicational inferencealgorithm is reconsidered from a contrary direction, which motivatesa new fuzzy inference strategy, called the double fuzzyimplications-based restriction inference algorithm. New restrictioninference principle is proposed, which improves the principle of thefull implication restriction inference algorithm. Furthermore,focusing on the ...

متن کامل

The Compositional Rule of Inference with Several Relations

The compositional rule of inference with several relations, which is the mainly used inference rule in approximate reasoning, is considered in this paper. Stability results are given and exact computational formulae are provided.

متن کامل

Do exact shapes of fuzzy sets matter?

An often raised objection to fuzzy logic can be articulated as follows. Fuzzy sets are intended to represent vague collections of objects. On the one hand, boundaries of such collections are inherently imprecise. On the other hand, fuzzy sets are defined by membership degrees which are precise. There is, therefore, an obvious discrepancy between the imprecision of a collection and the precision...

متن کامل

On the notion of assumption in logical systems

When a logical system is specified and the notion of a derivation or formal proof is explained, we are told (i) which formulas can be used to start a derivation and (ii) which formulas can be derived given that certain other formulas have already been derived. Formulas of the sort (i) are either assumptions or axioms, formulas of the sort (ii) are conclusions of (proper) inference rules. Axioms...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991